Reply to Krellenstein on Parallel Computation
نویسنده
چکیده
In replying to my argument that the speed furnished by parallel processing is highly relevant to the understanding of intelligence and mind, Krellenstein says that “the serial simulation of parallel processes and the portability of software are computational principles and everyday empirical realities.” While it is true that in principle parallel processes can be simulated on serial machines, the practical reality is that such simulations can be painfully slow. Ten years ago graduate students in artificial intelligence could be told not to worry about parallel computation because you could always simulate it on a serial machine. But now that speed-ups achieved in serial processes are running up against physical constraints such as the speed of light, increasing amounts of research in computer science in general and also in AI are concerned with parallel computation. According to Denning (1986), current supercomputers are within a factor of 10 of the processor speed limit determined by the speed of light in a chip. Once this limit is reached, the in-principle serial simulation of parallel processes will be no more of an “empirical” reality than the in-principle simulation of any computer by a Turing machine. The developers of connection machines and other parallel architectures (see references in Thagard, 1986) have important practical reasons for seeking the speed afforded by parallel processing that should not be ignored for abstract philosophical reasons. As for portability, at the practical level it is noteworthy that a great deal of non-trivial work is required to port programs between such simple machines as the IBM PC and the Apple Macintosh, let alone between more complex machines.
منابع مشابه
A Reply to "Parallel Computation and the Mind-Body Problem"
The following is in reply to some points made in Paul Thagard's " Parallel Computation and the Mind-Body Problem " (1986). (1) Thagard argues that increased speed has metaphysical importance because only intelligent creatures (or machines) quick enough to adequately deal with the demands of their environment will survive. Thus, the best possible serial simulation of a parallel algorithm, while ...
متن کاملEarly-Reply Components: Concurrent Execution with Sequential Reasoning
Generic software components have a reputation for being inefficient. Parallel implementations may improve performance, but can thwart reuse by being architecture-dependent or by exposing concurrency to client-side reasoning about component interactions. To address performance, we present Early-Reply as an alternative to blocking method invocations. Component operations can be partitioned into a...
متن کاملParallel computation framework for optimizing trailer routes in bulk transportation
We consider a rich tanker trailer routing problem with stochastic transit times for chemicals and liquid bulk orders. A typical route of the tanker trailer comprises of sourcing a cleaned and prepped trailer from a pre-wash location, pickup and delivery of chemical orders, cleaning the tanker trailer at a post-wash location after order delivery and prepping for the next order. Unlike traditiona...
متن کاملEfficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کاملOptimization of Agricultural BMPs Using a Parallel Computing Based Multi-Objective Optimization Algorithm
Beneficial Management Practices (BMPs) are important measures for reducing agricultural non-point source (NPS) pollution. However, selection of BMPs for placement in a watershed requires optimizing available resources to maximize possible water quality benefits. Due to its iterative nature, the optimization typically takes a long time to achieve the BMP trade-off results which is not desirable ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Cognitive Science
دوره 11 شماره
صفحات -
تاریخ انتشار 1987